منابع مشابه
Walks in phylogenetic treespace
We prove that the spaces of unrooted phylogenetic trees are Hamiltonian for two popular search metrics: Subtree Prune and Regraft (SPR) and Tree Bisection and Reconnection (TBR). Further, we make progress on two conjectures of Bryant on searching phylogenetic treespace: treespace under the Nearest Neighbor Interchange (NNI) metric has a 2-walk, and there exists SPR neighborhoods without complet...
متن کاملOn Product and Bündle Neighborhoods
If a nice space X is embedded in a euclidean space, it may fail to have product neighborhoods; i.e., neighborhoods which are products of X with a ball. However, if the euclidean space is a hyperplane of a higher-dimensional euclidean space one can sometimes guarantee the existence of product neighborhoods in the big euclidean space. For example, it follows from a lemma due to Klee [l ] that if ...
متن کاملIntegration of SPR biosensors with mass spectrometry (SPR-MS).
The combination of surface plasmon resonance (SPR) and mass spectrometry (MS) creates a comprehensive protein investigation approach wherein SPR is employed for protein quantification and MS is utilized to structurally characterize the proteins. In such, MS utterly complements the SPR detection and reveals intrinsic protein structural modifications that go unregistered via the SPR detection. Pr...
متن کاملWalks on Weighted Graphs
We now define random walks on weighted graphs. We will let A denote the adjacency matrix of a weighted graph. We will also the graph to have self-loops, which will correspond to diagonal entries in A. Thus, the only restriction on A is that is be symmetric and non-negative. When our random walk is at a vertex u, it will go to node v with probability proportional to au,v: mu,v def = au,v ∑ w au,w .
متن کاملRandom Walks on Z
For each positive integer n 3 let Zi be the direct product of n copies of Z i e Zz= { a a aJ ai= or for all i= n} and let {W } o be a random walk on ZZ such that P{ Wá A } = n for all A's in Zz and P { W _ a a an WJ J " at a a n } P{Wn +t = a a3 a n Wl _ a a a n } =z for all j= I and all a a a n 's in Z" For each positive integer n > let Cn denote the covering time taken by the random walk W on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Computational Biology and Bioinformatics
سال: 2013
ISSN: 1545-5963
DOI: 10.1109/tcbb.2012.136